Efficient Distributed Detection of Conjunctions of Local Predicates

Global predicate detection is a fundamental problem in distributed systems and nds applications in many domains such as testing and debugging distributed programs. This paper presents two eecient distributed algorithms to detect conjunctive form global predicates in distributed systems. The algorithms detect the rst consistent global state that satisses the predicate even if the predicate is unstable. The algorithms are based on complementary approaches and are dual of each other. The algorithms are distributed because the predicate detection eeorts as well as the necessary information is equally distributed among the processes. We prove the correctness of the algorithms and compare their performance with those of the existing predicate detection algorithms. The proposed algorithms compare very favorably with the existing algorithms in terms of the number of messages exchanged for predicate detection. Mots-cl e : Syst emes r epartis, D etection au vol de pr edicats globaux.